Infinitely many roots of unity are zeros of some Jones polynomials
نویسندگان
چکیده
Let $$N=2n^2-1$$ or $$N=n^2+n-1$$ , for any $$n\ge 2$$ . $$M=\frac{N-1}{2}$$ We construct families of prime knots with Jones polynomials $$(-1)^M\sum _{k=-M}^{M} (-1)^kt^k$$ Such have Mahler measure equal to 1. If N is prime, these are cyclotomic $$\Phi _{2N}(t)$$ up some shift in the powers t. Otherwise, they products such polynomials, including In particular, all roots unity $$\zeta _{2N}$$ occur as polynomials. also show that cannot be zeros
منابع مشابه
Zeros of Jones Polynomials of Graphs
In this paper, we introduce the Jones polynomial of a graph G = (V,E) with k components as the following specialization of the Tutte polynomial: JG(t) = (−1)|V |−kt|E|−|V TG(−t,−t). We first study its basic properties and determine certain extreme coefficients. Then we prove that (−∞, 0] is a zero-free interval of Jones polynomials of connected bridgeless graphs while for any small > 0 or large...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملMacdonald polynomials at roots of unity
The aim of this note is to give some factorisation formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those given in [LLT1] for Hall-Littlewood functions. Résumé. Le but de cette note est de donner quelques formules de factorisations pour différentes versions des polynômes de Macdonald lorsque le paramètre t est spéci...
متن کاملPrimitive Roots of Unity and Cyclotomic Polynomials
One can prove the following proposition (1) For every natural number n holds n = 0 or n = 1 or n 2. The scheme Comp Ind NE concerns a unary predicate P, and states that: For every non empty natural number k holds P[k] provided the parameters satisfy the following condition: • For every non empty natural number k such that for every non empty natural number n such that n < k holds P[n] holds P...
متن کاملConsequences of a Factorization Theorem for Generalized Exponential Polynomials with Infinitely Many Integer Zeros
A factorization theorem is proved for a class of generalized exponential polynomials having all but finitely many of integer zeros belong to a finite union of arithmetic progressions. This theorem extends a similar result for ordinary exponential polynomials due to H. N. Shapiro in 1959. The factorization makes apparent those factors corresponding to all zeros in such a union.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2022
ISSN: ['0046-5755', '1572-9168']
DOI: https://doi.org/10.1007/s10711-022-00708-4